A Survey of Meta-Heuristic Solution Methods for the Quadratic Assignment Problem
نویسندگان
چکیده
The quadratic assignment problem (QAP) belongs to the class of NP-Hard problems and also is one of the hardest problems in this class. Today, regarding current hardware, solving the large size instances of this problem, using exact methods, is not possible in reasonable amount of time. In this way many heuristic (Meta-heuristic) and approximation methods and soft-computing approaches have been applied to this problems that we will review some of them in this paper. The aim of this paper is to compare some of efficient heuristic (Meta-heuristic) and soft-computing methods known up to now. Some of them are imitated from the nature’s behavior while some other are most analytical. These methods are known as Ant Colony Optimization (ACO), Artificial Neural Networks (NN), Genetic Algorithms (GA), Scatter Search (SS), Simulated Annealing (SA), Tabu Search (TS) and Greedy Randomized Adaptive Search Procedure (GRASP). Mathematics Subject Classification: 49N10
منابع مشابه
Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and particle swarm optim...
متن کامل